Learning Curves: Asymptotic Values and Rate of Convergence
نویسندگان
چکیده
Training classifiers on large databases is computationally demanding. It is desirable to develop efficient procedures for a reliable prediction of a classifier's suitability for implementing a given task, so that resources can be assigned to the most promising candidates or freed for exploring new classifier candidates. We propose such a practical and principled predictive method. Practical because it avoids the costly procedure of training poor classifiers on the whole training set, and principled because of its theoretical foundation. The effectiveness of the proposed procedure is demonstrated for both singleand multi-layer networks.
منابع مشابه
Asymptotic behavior of a system of two difference equations of exponential form
In this paper, we study the boundedness and persistence of the solutions, the global stability of the unique positive equilibrium point and the rate of convergence of a solution that converges to the equilibrium $E=(bar{x}, bar{y})$ of the system of two difference equations of exponential form: begin{equation*} x_{n+1}=dfrac{a+e^{-(bx_n+cy_n)}}{d+bx_n+cy_n}, y_{n+1}=dfrac{a+e^{-(by_n+cx_n)}}{d+...
متن کاملTwo Novel Learning Algorithms for CMAC Neural Network Based on Changeable Learning Rate
Cerebellar Model Articulation Controller Neural Network is a computational model of cerebellum which acts as a lookup table. The advantages of CMAC are fast learning convergence, and capability of mapping nonlinear functions due to its local generalization of weight updating, single structure and easy processing. In the training phase, the disadvantage of some CMAC models is unstable phenomenon...
متن کاملFrom Q( ) to Average Q-learning: Efficient Implementation of an Asymptotic Approximation
Q( ) is a reinforcement learning algorithm that combines Q-learning and TD( ). Online implementations of Q( ) that use eligibility traces have been shown to speed basic Q-learning. In this paper we present an asymptotic analysis of Watkins’ Q( ) with accumulative eligibility traces. We first introduce an asymptotic approximation of Q( ) that appears to be a gain matrix variant of basic Qlearnin...
متن کاملCystoscopy Image Classication Using Deep Convolutional Neural Networks
In the past three decades, the use of smart methods in medical diagnostic systems has attractedthe attention of many researchers. However, no smart activity has been provided in the eld ofmedical image processing for diagnosis of bladder cancer through cystoscopy images despite the highprevalence in the world. In this paper, two well-known convolutional neural networks (CNNs) ...
متن کاملAlmost Sure Convergence of Kernel Bivariate Distribution Function Estimator under Negative Association
Let {Xn ,n=>1} be a strictly stationary sequence of negatively associated random variables, with common distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1, Xk+1) for fixed $K /in N$ based on kernel type estimators. We introduce asymptotic normality and properties and moments. From these we derive the optimal bandwidth...
متن کامل